Deeba Kannan

0:04:36

TOC Lec - Moore to Mealy Machine conversion

0:05:59

TOC Lec 00-Introduction to Theory of computation by Deeba Kannan

0:27:37

Turing Machine Formal Representation by Deeba Kannan

0:03:57

TOC Lec 38-Simple example for Turing machine by Deeba Kannan

0:16:53

TOC Lec - Introduction to Moore and Mealy by Deeba Kannan

0:07:04

Artificial Intelligence - Depth first search by Deeba kannan

0:04:42

TOC Lec 50 - Variants of Turing machine by Deeba Kannan

0:16:49

TOC Lec 35-Push Down Automata to Context Free Grammar by Deeba Kannan

0:03:32

TOC Lec 02-NFA and DFA by Deeba Kannan

0:16:04

TOC Lec 11 - Regular Expression to Deterministic Finite Automata by Deeba Kannan

0:04:42

TOC Lec 27 - Chomsky normal form by Deeba Kannan

0:04:10

Computational Logic - Example for Modus Tollens by Deeba Kannan

0:11:06

TOC Lec 01-Introduction to finite automata(FA) by Deeba Kannan

0:05:47

TOC Lec 29-introduction to Push Down Automata by Deeba Kannan

0:05:11

ImmunoComputing part 2 - Pattern Matching and Binding Deeba kannan

0:08:14

Computational Logic - Rule for implication by Deeba Kannan

0:08:58

TOC Solved MCQ Question - Unit 1 - Part 6 - Deeba Kannan

0:17:30

TOC Lec 17 - DFA to Regular expression by Deeba Kannan

0:12:10

TOC Solved MCQ Question - Unit 2 - Part 4 - Deeba Kannan

0:05:43

TOC Solved MCQ Question - Unit 2 - Part 2 - Deeba Kannan

0:17:10

TOC Lec 14 - minimization of DFA by Deeba Kannan

0:05:02

TOC Lec 24 - Elimination of useless symbols in Context free grammar by Deeba Kannan

0:32:36

Compiler Design Lec - 26 - Predictive parser LL(1) by Deeba Kannan

0:12:05

Computational Logic - Introduction to natural deduction by Deeba Kannan